Exponential time reductions and sparse languages in NEXP
نویسنده
چکیده
In this paper we define a many-one reduction which is allowed to work in exponential time but may only output polynomially many symbols. We show that there are no NEXP-hard sparse languages under our reduction unless EXP = UEXP.
منابع مشابه
Separating NE from Some Nonuniform Nondeterministic Complexity Classes
We investigate the question whether NE can be separated from the reduction closures of tally sets, sparse sets and NP. We show that (1) NE ⊆ RNP no(1)−T (TALLY); (2) NE ⊆ R m (SPARSE); (3) NEXP ⊆ PNP nk−T /n for all k ≥ 1; and (4) NE ⊆ Pbtt (NP ⊕ SPARSE). Result (3) extends a previous result by Mocas to nonuniform reductions. We also investigate how different an NE-hard set is from an NP-set. W...
متن کاملNon-autoreducible Sets for NEXP
We investigate autoreducibility properties of complete sets for NEXP under different polynomial reductions. Specifically, we show under some polynomial reductions that there is are complete sets for NEXP that are not autoreducible. We obtain the following results: • There is a ≤ptt -complete set for NEXP that is not ≤ p btt -autoreducible. • For any positive integers s and k such that 2 − 1 > k...
متن کاملAn exponential time upper bound for Quantum Merlin-Arthur games with unentangled provers
We prove a deterministic exponential time upper bound for Quantum Merlin-Arthur games with k unentangled provers. This is the first non-trivial upper bound of QMA(k) better than NEXP and can be considered an exponential improvement, unless EXP = NEXP. The key ideas of our proof are to use perturbation theory to reduce the QMA(2)-complete SEPARABLE SPARSE HAMILTONIAN problem to a variant of the ...
متن کاملDaniel Apon 1 From IP = PSPACE to NP = PCP ( log , 1 ) : NEXP has multi - prover interactive protocols
If you’ve read the notes on the history of the PCP theorem referenced in Lecture 19 [3], you will already be familiar with the excitement that surrounded discoveries such as IP=PSPACE and NP=PCP(log, 1). Taken alone, however, these two theorems might seem at most cursorily related to one another. The earlier discovery of IP=PSPACE deals with a much stronger class, assuming the polynomial hierar...
متن کاملSplittings, Robustness and Structure of Complete Sets
We investigate the structure of EXP and NEXP complete and hard sets under various kinds of reductions. In particular, we are interested in the way in which information that makes the set complete is stored in the set. To address this question for a given hard set A, we construct a sparse set S, and ask whether A ? S is still hard. It turns out that for most of the reductions considered and for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره شماره
صفحات -
تاریخ انتشار 2004